Routley Star in Information-Based Semantics

نویسندگان

چکیده

It is common in various non-classical logics, especially relevant to characterize negation semantically via the operation known as Routley star. This works well within relational semantic frameworks based on prime theories. We study this context of "information-based" semantics for which it characteristic that sets formulas supported by individual information states are theories do not have be prime. will show that, somewhat surprisingly, incorporation star into information-based does lead a collapse or trivialization whole system. On contrary, leads technically elegant though quite restricted framework determines particular logic. some basic properties semantics. For example, we double law valid only involutive linear frames. axiomatically logic all frames and coincides with system Mike Dunn coined Kalman fragment (for language conjunction, disjunction negation) "semi-relevant" R-mingle. Finally, deductive equipped

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Routley-meyer Semantics for Ackermann’s Logics of “strenge Implikation”

The aim of this paper is to provide a Routley-Meyer semantics for Ackermann’s logics of “strenge Implikation” Π′ and Π′′. Besides the Disjunctive Syllogism, this semantics validates the rules Necessitation and Assertion. Strong completeness theorems for Π′ and Π′′ are proved. A brief discussion on Π′, Π′′ and paraconsistency is included.

متن کامل

Semantics-based Information Retrieval

In this paper we investigate the use of conceptual descriptions based on description logics for contentbased information retrieval and present several innovative contributions. We provide a query-byexamples retrieval framework which avoids the drawback of a sophisticated query language. We extend an existing DL to deal with spatial concepts. We provide a content-based similarity measure based o...

متن کامل

STAR: chart - Preserving Data Semantics in Web-Based Applications

Every time a Web-based interface is built upon pre-existing data-sources, the result comes often from a difficult and painful process of negotiation between the data manager – who knows the “semantics” of the data to be exposed, but cannot build the UI on his own – and the Web designer – who cares a lot about the presentation and the rendering, but often is not an expert about the content to be...

متن کامل

Context Based Semantics for Information

limited distribution notice This report has been submitted for publication outside of ITC and will probably be copyrighted if accepted for publication. It has been issued as a Technical Report for early dissemination of its contents. In view of thetransfer of copyright to the outside publisher, its distribution outside of ITC prior to publication should be limited to peer communications and spe...

متن کامل

Negation in Relevant Logics (how I Stopped Worrying and Learned to Love the Routley Star)

Negation raises three thorny problems for anyone seeking to interpret relevant logics. The frame semantics for negation in relevant logics involves a `point shift' operator. Problem number one is the interpretation of this operator. Relevant logics commonly interpreted take the inference from A and A _ B to B to be invalid, because the corresponding relevant conditional A ^ (A _ B) ! B is not a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic proceedings in theoretical computer science

سال: 2022

ISSN: ['2075-2180']

DOI: https://doi.org/10.4204/eptcs.358.21